- computation run
- Техника: просчёт (пробный расчёт или решение)
Универсальный англо-русский словарь. Академик.ру. 2011.
computation run
Смотреть что такое "computation run" в других словарях:
Run-time algorithm specialisation — In computer science, run time algorithm specialisation is a methodology for creating efficient algorithms for costly computation tasks of certain kinds. The methodology originates in the field of automated theorem proving and, more specifically,… … Wikipedia
computation of time — For the purpose of calculating time under the Rules of Civil Procedure, the day of the act or event from which the designated period of time begins to run shall not be included. The last day of the period so computed shall be included, unless it… … Black's law dictionary
computation of time — For the purpose of calculating time under the Rules of Civil Procedure, the day of the act or event from which the designated period of time begins to run shall not be included. The last day of the period so computed shall be included, unless it… … Black's law dictionary
Secure multi-party computation — (also known as secure computation or multi party computation (MPC)) is a sub field of cryptography. The goal of methods for secure multi party computation is to enable parties to jointly compute a function over their inputs, while at the same… … Wikipedia
Parallel computation thesis — In computational complexity theory, the parallel computation thesis is a hypothesis which states that the time used by a (reasonable) parallel machine is polynomially related to the space used by a sequential machine. The parallel computation… … Wikipedia
Advanced Computation Group — The Advanced Computation Group (ACG) is a group within Apple Inc. The ACG researches algorithms and high performance issues relevant to Apple technology. ACG concentrates on Mac OS X for scientific applications, vectorization, tutorials,… … Wikipedia
CARDboard Illustrative Aid to Computation — Cardiac (CARDboard Illustrative Aid to Computation) was a learning aid developed by David Hagelbarger and Saul Fingerman for Bell Telephone Laboratories in 1968 to teach high school students how computers work. The kit consisted of an instruction … Wikipedia
Computability — You might be looking for Computable function, Computability theory, Computation, or Theory of computation. Computability is the ability to solve a problem in an effective manner. It is a key topic of the field of computability theory within… … Wikipedia
computer — computerlike, adj. /keuhm pyooh teuhr/, n. 1. Also called processor. an electronic device designed to accept data, perform prescribed mathematical and logical operations at high speed, and display the results of these operations. Cf. analog… … Universalium
Halting problem — In computability theory, the halting problem can be stated as follows: Given a description of a computer program, decide whether the program finishes running or continues to run forever. This is equivalent to the problem of deciding, given a… … Wikipedia
Computability theory (computer science) — In computer science, computability theory is the branch of the theory of computation that studies which problems are computationally solvable using different models of computation.Computability theory differs from the related discipline of… … Wikipedia
